Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Efficient dynamic data audit scheme for resource-constrained users
LI Xiuyan, LIU Mingxi, SHI Wenbo, DONG Guofang
Journal of Computer Applications    2021, 41 (2): 422-432.   DOI: 10.11772/j.issn.1001-9081.2020050614
Abstract361)      PDF (1658KB)(497)       Save
Internet of Things (IoT) devices promote the rapid development of cloud storage outsourcing data service, which is favored by more and more terminal users. Therefore, how to ensure the integrity verification of user data in cloud server has become a hot issue that needs to be solved urgently. For resource-constrained users, current cloud data audit scheme has the problems such as complex computation, high cost and low efficiency. To solve these problems, an efficient dynamic data audit scheme for resource-constrained users was proposed. First, a new data structure was proposed based on Novel Counting Bloom Filter (NCBF) and Multi-Merkle Hash Tree (M-MHT) to support dynamic audit, namely NCBF-M-MHT. In this data structure, the NCBF structure was able to realize the dynamic updating request of data within O(1) time, thereby ensuring the efficiency of audit. And the root node of M-MHT structure performed signing by user authentication to ensure the security of data. Then, different allocation methods were adopted for different audit entities, and the data evidence and label evidence were used to verify the correctness and integrity of data. Experimental results show that compared with the audit scheme based on Dynamic Hash Table (DHT), the audit scheme based on Merkle Hash Tree (MHT) and the audit scheme based on Location Array-Doubly Linked Info Table (LA-DLIT), the time cost of the proposed scheme in the audit verification phase is reduced by 45.40%, 23.71% and 13.85%, and the time cost in the dynamic update phase is reduced by 43.33%, 27.50% and 17.58% respectively.
Reference | Related Articles | Metrics